Implementation of Kogbetliantz's SVD algorithm using orthonormal μ-rotations
نویسندگان
چکیده
In this paper the implementation of Kogbetliantz's SVD algorithm using orthonormal {rotations is presented. An orthonormal {rotation is a rotation by an angle of a given set of {rotation angles (e.g. the angles i = arctan 2 ?i) which are choosen such that the rotation can be implemented by a small amount of shift{add operations. All computations (evaluation and application of the rotations) can entirely be referred to or-thonormal {rotations. Simulations show the reduced computational complexity of Kogbetliantz's SVD algorithm based on orthonormal {rotations comparded to the standard Kogbetliantz SVD algorithm.
منابع مشابه
Parallel Svd{updating Using Approximate Rotations
In this paper a parallel implementation of the SVD{updating algorithm using approximate rotations is presented. In its original form the SVD{updating algorithm had numerical problems if no reorthogonalization steps were applied. Representing the orthogonal matrix V (right singular vectors) using its parameterization in terms of the rotation angles of n(n?1)=2 plane rotations these reorthogonali...
متن کاملSVD { Updating Using Orthonormal { Rotations
In this paper the implementation of the SVD{updating algorithm using orthonormal { rotations is presented. An orthonormal {rotation is a rotation by an angle of a given set of {rotation angles (e.g. the angles i = arctan2 ?i) which are choosen such that the rotation can be implemented by a small amount of shift{add operations. A version of the SVD{updating algorithm is used where all computatio...
متن کاملAn algorithm and architecture based on orthonormal μ-rotations for computing the symmetric EVD
In this paper an algorithm and architecture for computing the eigenvalue decomposition (EVD) of a symmetric matrix is presented. The EVD is computed using a Jacobi-type method, where the angle of the rotations is approximated by an angle k , corresponding to an orthonormal {rotation. These orthonormal {rotations are based on the idea of CORDIC and share the property that performing the rotation...
متن کاملEfficient implementations of pipelined CORDIC based IIR digital filters using fast orthonormal μ-rotations
CORDIC based IIR digital lters are orthogonal lters whose internal computations consist of orthogonal transformations. These lters possess desirable properties for VLSI implementations such as regularity, local connection, low sensitivity to nite word-length implementation, and elimination of limit cycles. Recently, ne-grain pipelined CORDIC based IIR digital lter architectures which can perfor...
متن کاملOrthogonal Approximation of the Discrete Cosine Transform
The eecient implementation of the discrete cosine tansform is discussed in this paper. The architecture, that is used, is a systolic processor array consisting of orthonormal rotations. The angles of these rotations are denoted by ij. With respect to a simple VLSI implementation an approximation of the DCT is realized. The approximation is obtained by using approximate (orthogonal) rotations. I...
متن کامل